Union-Closed Families with Small Average Overlap Densities
نویسندگان
چکیده
In this very short paper, we show that the average overlap density of a union-closed family $\mathcal{F}$ subsets $\{1,2,\ldots,n\}$ may be as small \[\Theta((\log_2 \log_2 |\mathcal{F}|)/(\log_2 |\mathcal{F}|)),\] for infinitely many positive integers $n$.
منابع مشابه
Random Union-Closed Families
We shall show that the union-closed families conjecture holds for a random union-closed family with high probability. This strengthens a recent result of Bruhn and Schaudt.
متن کاملUnion-closed families of sets
A family of sets is union-closed if it contains the union of any two of its elements. Some years ago, Reimer gave a lower bound for the average size of an element of a union-closed family consisting of m sets and, two years ago, Czédli did the same under the additional condition that our sets are contained in a set with n elements. Recently Tom Eccles and I have determined the minimum average s...
متن کاملDensities of Minor-Closed Graph Families
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities. This set of numbers is countable, well-ordered, and closed; its order type is at least ωω. It is the closure of the set of densities of density-minimal graphs...
متن کاملMinimal Weight in Union-Closed Families
Let Ω be a finite set and let S ⊆ P(Ω) be a set system on Ω. For x ∈ Ω, we denote by dS(x) the number of members of S containing x. A long-standing conjecture of Frankl states that if S is union-closed then there is some x ∈ Ω with dS(x) ≥ 12 |S|. We consider a related question. Define the weight of a family S to be w(S) := ∑ A∈S |A|. Suppose S is union-closed. How small can w(S) be? Reimer sho...
متن کاملNew Conjectures for Union-Closed Families
The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead prove that 2a is an upper bound to the number of sets in a union-closed family on a ground set of n elements where each element is in at most a sets for all a, n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2022
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10121